CODMA: A Novel Global Optimization Algorithm based on Open Source Development Model Algorithm with Chaotic Exploration
نویسندگان
چکیده
The open source Development Model Algorithm (ODMA) that was recently introduced has shown its good performance in optimization problems. In this algorithm each point in solution space of the given function has considered as open source software. The considered software (point in the solution space) evolves over time by open source development mechanism. In this paper we present a modified ODMA combine with chaos theory (CODMA). Chaos as a kind of dynamic behavior of nonlinear systems has raised enormous interest in different fields of sciences such as chaos control, pattern recognition, optimization theory and so on. Optimization algorithms based on the chaos theory are stochastic search methodologies that differ from any of the existing evolutionary computation and swarm intelligence methods. General ODMA as like as many evolutionary algorithm may fall into local minimum trap, during the search process, to mitigate this problem we increased the exploration ability of the ODMA, using chaotic behaviour in the Moving toward leading softwares operation. This algorithm is tested by 4 benchmark functions and the results show that the algorithm approach to the global minimum of these functions successfully, also the algorithm is compared with ODMA, GA and PSO and as we shown CODMA have better accuracy and convergence for finding global minima.
منابع مشابه
Non-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملChaotic-based Particle Swarm Optimization with Inertia Weight for Optimization Tasks
Among variety of meta-heuristic population-based search algorithms, particle swarm optimization (PSO) with adaptive inertia weight (AIW) has been considered as a versatile optimization tool, which incorporates the experience of the whole swarm into the movement of particles. Although the exploitation ability of this algorithm is great, it cannot comprehensively explore the search space and may ...
متن کاملImproved COA with Chaotic Initialization and Intelligent Migration for Data Clustering
A well-known clustering algorithm is K-means. This algorithm, besides advantages such as high speed and ease of employment, suffers from the problem of local optima. In order to overcome this problem, a lot of studies have been done in clustering. This paper presents a hybrid Extended Cuckoo Optimization Algorithm (ECOA) and K-means (K), which is called ECOA-K. The COA algorithm has advantages ...
متن کاملA novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملA Novel Intelligent Water Drops Optimization Approach for Estimating Global Solar Radiation
Normal 0 false false false EN-US X-NONE AR-SA MicrosoftInternetExplorer4 Measurement of solar radiance demands expensive devices to be used. Alternatively, estimator models are used instead. In this paper, a new method based on the empirical equations is introduced to estimate the monthly average daily global solar radiation on a horizontal surface. The proposed method uses Intelligent Water ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013